Stochastic stability in assignment problems
نویسندگان
چکیده
منابع مشابه
Stability of stochastic optimization problems - nonmeasurable case
This paper deals with stability of stochastic optimization problems in a general setting. Objective function is defined on a metric space and depends on a probability measure which is unknown, but, estimated from empirical observations. We try to derive stability results without precise knowledge of problem structure and without measurability assumption. Moreover, ε-optimal solutions are consid...
متن کاملA Stochastic Programming Approach to Resource-Constrained Assignment Problems
We address the resource-constrained generalizations of the assignment problem with uncertain resource capacities, where the resource capacities have an unknown distribution that can be sampled. We propose three stochastic programming-based formulations that can be used to solve this problem, and provide exact and approximate solution techniques for the resulting models. We also present numerica...
متن کاملExact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment of each job to an agent is decided a priori, and once the demands are known, reassignments can be performed if there are overloaded agents. We construct a convex approximation of the objective function that is sharp a...
متن کاملAsymmetric Problems and Stochastic Process Models of Traffic Assignment
There is a spectrum of asymmetric assignment problems to which existing results on uniqueness of equilibrium do not apply. Moreover, multiple equilibria may be seen to exist in a number of simple examples of real-life phenomena, including interactions at priority junctions, responsive traffic signals, multiple user classes, and multi-modal choices. In contrast, recent asymptotic results on the ...
متن کاملOn the Stability in Stochastic Programming - Generalized Simple Recourse Problems
Stochastic programming problems with simple recourse belong to problems depending on a random element only through the corresponding probability measure. Consequently, this probability measure can be treated as a parameter of the problem. In this paper the stability with respect to the above mentioned parameter will be studied for generalized simple recourse problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2016
ISSN: 0304-4068
DOI: 10.1016/j.jmateco.2015.11.002